0.06/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.06/0.15	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.13/0.36	% Computer   : n027.cluster.edu
0.13/0.36	% Model      : x86_64 x86_64
0.13/0.36	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.36	% Memory     : 8042.1875MB
0.13/0.36	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.36	% CPULimit   : 1200
0.13/0.36	% WCLimit    : 120
0.13/0.36	% DateTime   : Tue Jul 13 15:48:55 EDT 2021
0.13/0.36	% CPUTime    : 
0.13/0.36	% Number of cores: 8
0.13/0.36	% Python version: Python 3.6.8
0.13/0.36	# Version: 2.6rc1-ho
0.22/0.38	# No SInE strategy applied
0.22/0.38	# Trying AutoSched0 for 59 seconds
0.40/0.58	# AutoSched0-Mode selected heuristic G_E___303_C18_F1_URBAN_S0Y
0.40/0.58	# and selection function SelectMaxLComplexAvoidPosPred.
0.40/0.58	#
0.40/0.58	# Preprocessing time       : 0.192 s
0.40/0.58	
0.40/0.58	# Proof found!
0.40/0.58	# SZS status Theorem
0.40/0.58	# SZS output start CNFRefutation
0.40/0.58	thf(def_n_is, axiom, (n_is)=(^[X753:$i, X754:$i]:(X753)=(X754)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_n_is)).
0.40/0.58	thf(def_e_is, axiom, (e_is)=(^[X1:$i, X60:$i, X61:$i]:(X60)=(X61)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_e_is)).
0.40/0.58	thf(def_all_of, axiom, (all_of)=(^[X3:$i > $o, X2:$i > $o]:![X4:$i]:(X3 @ X4=>X2 @ X4)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_all_of)).
0.40/0.58	thf(def_is_of, axiom, (is_of)=(^[X1:$i, X2:$i > $o]:X2 @ X1), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_is_of)).
0.40/0.58	thf(def_n_eq, axiom, (n_eq)=(^[X1:$i, X218:$i]:(n_ts @ (num @ X1) @ (den @ X218))=(n_ts @ (num @ X218) @ (den @ X1))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', def_n_eq)).
0.40/0.58	thf(satz62b, conjecture, all_of @ (^[X1:$i]:in @ X1 @ frac) @ (^[X1:$i]:all_of @ (^[X377:$i]:in @ X377 @ frac) @ (^[X378:$i]:all_of @ (^[X4:$i]:in @ X4 @ frac) @ (^[X4:$i]:(n_eq @ X1 @ X378=>n_eq @ (n_pf @ X1 @ X4) @ (n_pf @ X378 @ X4))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', satz62b)).
0.40/0.58	thf(satz56, axiom, all_of @ (^[X1:$i]:in @ X1 @ frac) @ (^[X1:$i]:all_of @ (^[X524:$i]:in @ X524 @ frac) @ (^[X525:$i]:all_of @ (^[X4:$i]:in @ X4 @ frac) @ (^[X4:$i]:all_of @ (^[X10:$i]:in @ X10 @ frac) @ (^[X10:$i]:(n_eq @ X1 @ X525=>(n_eq @ X4 @ X10=>n_eq @ (n_pf @ X1 @ X4) @ (n_pf @ X525 @ X10))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', satz56)).
0.40/0.58	thf(c_0_7, axiom, (n_is)=(^[X753:$i, X754:$i]:(X753)=(X754)), inference(apply_def,[status(thm)],[def_n_is, def_e_is])).
0.40/0.58	thf(c_0_8, axiom, (all_of)=(^[X3:$i > $o, X2:$i > $o]:![X4:$i]:(X3 @ X4=>X2 @ X4)), inference(apply_def,[status(thm)],[def_all_of, def_is_of])).
0.40/0.58	thf(c_0_9, axiom, (n_eq)=(^[X1:$i, X218:$i]:(n_ts @ (num @ X1) @ (den @ X218))=(n_ts @ (num @ X218) @ (den @ X1))), inference(apply_def,[status(thm)],[def_n_eq, c_0_7])).
0.40/0.58	thf(c_0_10, negated_conjecture, ~(![X2941:$i]:(in @ X2941 @ frac=>![X2946:$i]:(in @ X2946 @ frac=>![X2947:$i]:(in @ X2947 @ frac=>((n_ts @ (num @ X2941) @ (den @ X2946))=(n_ts @ (num @ X2946) @ (den @ X2941))=>(n_ts @ (num @ (n_pf @ X2941 @ X2947)) @ (den @ (n_pf @ X2946 @ X2947)))=(n_ts @ (num @ (n_pf @ X2946 @ X2947)) @ (den @ (n_pf @ X2941 @ X2947)))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[satz62b]), c_0_8]), c_0_9])).
0.40/0.58	thf(c_0_11, plain, ![X4795:$i]:(in @ X4795 @ frac=>![X4801:$i]:(in @ X4801 @ frac=>![X4802:$i]:(in @ X4802 @ frac=>![X4803:$i]:(in @ X4803 @ frac=>((n_ts @ (num @ X4795) @ (den @ X4801))=(n_ts @ (num @ X4801) @ (den @ X4795))=>((n_ts @ (num @ X4802) @ (den @ X4803))=(n_ts @ (num @ X4803) @ (den @ X4802))=>(n_ts @ (num @ (n_pf @ X4795 @ X4802)) @ (den @ (n_pf @ X4801 @ X4803)))=(n_ts @ (num @ (n_pf @ X4801 @ X4803)) @ (den @ (n_pf @ X4795 @ X4802))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[satz56, c_0_8]), c_0_9])).
0.40/0.58	thf(c_0_12, negated_conjecture, (in @ esk102_0 @ frac&(in @ esk103_0 @ frac&(in @ esk104_0 @ frac&((n_ts @ (num @ esk102_0) @ (den @ esk103_0))=(n_ts @ (num @ esk103_0) @ (den @ esk102_0))&(n_ts @ (num @ (n_pf @ esk102_0 @ esk104_0)) @ (den @ (n_pf @ esk103_0 @ esk104_0)))!=(n_ts @ (num @ (n_pf @ esk103_0 @ esk104_0)) @ (den @ (n_pf @ esk102_0 @ esk104_0))))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])).
0.40/0.58	thf(c_0_13, plain, ![X5930:$i, X5931:$i, X5932:$i, X5933:$i]:(~in @ X5930 @ frac|(~in @ X5931 @ frac|(~in @ X5932 @ frac|(~in @ X5933 @ frac|((n_ts @ (num @ X5930) @ (den @ X5931))!=(n_ts @ (num @ X5931) @ (den @ X5930))|((n_ts @ (num @ X5932) @ (den @ X5933))!=(n_ts @ (num @ X5933) @ (den @ X5932))|(n_ts @ (num @ (n_pf @ X5930 @ X5932)) @ (den @ (n_pf @ X5931 @ X5933)))=(n_ts @ (num @ (n_pf @ X5931 @ X5933)) @ (den @ (n_pf @ X5930 @ X5932))))))))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])).
0.40/0.58	thf(c_0_14, negated_conjecture, (n_ts @ (num @ (n_pf @ esk102_0 @ esk104_0)) @ (den @ (n_pf @ esk103_0 @ esk104_0)))!=(n_ts @ (num @ (n_pf @ esk103_0 @ esk104_0)) @ (den @ (n_pf @ esk102_0 @ esk104_0))), inference(split_conjunct,[status(thm)],[c_0_12])).
0.40/0.58	thf(c_0_15, plain, ![X1:$i, X4:$i, X6:$i, X5:$i]:((n_ts @ (num @ (n_pf @ X1 @ X5)) @ (den @ (n_pf @ X4 @ X6)))=(n_ts @ (num @ (n_pf @ X4 @ X6)) @ (den @ (n_pf @ X1 @ X5)))|~in @ X1 @ frac|~in @ X4 @ frac|~in @ X5 @ frac|~in @ X6 @ frac|(n_ts @ (num @ X1) @ (den @ X4))!=(n_ts @ (num @ X4) @ (den @ X1))|(n_ts @ (num @ X5) @ (den @ X6))!=(n_ts @ (num @ X6) @ (den @ X5))), inference(split_conjunct,[status(thm)],[c_0_13])).
0.40/0.58	thf(c_0_16, negated_conjecture, (n_ts @ (num @ esk102_0) @ (den @ esk103_0))=(n_ts @ (num @ esk103_0) @ (den @ esk102_0)), inference(split_conjunct,[status(thm)],[c_0_12])).
0.40/0.58	thf(c_0_17, negated_conjecture, in @ esk104_0 @ frac, inference(split_conjunct,[status(thm)],[c_0_12])).
0.40/0.58	thf(c_0_18, negated_conjecture, in @ esk103_0 @ frac, inference(split_conjunct,[status(thm)],[c_0_12])).
0.40/0.58	thf(c_0_19, negated_conjecture, in @ esk102_0 @ frac, inference(split_conjunct,[status(thm)],[c_0_12])).
0.40/0.58	thf(c_0_20, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_16]), c_0_17]), c_0_18]), c_0_19])]), ['proof']).
0.40/0.58	# SZS output end CNFRefutation
0.40/0.58	# Proof object total steps             : 21
0.40/0.58	# Proof object clause steps            : 7
0.40/0.58	# Proof object formula steps           : 14
0.40/0.58	# Proof object conjectures             : 9
0.40/0.58	# Proof object clause conjectures      : 6
0.40/0.58	# Proof object formula conjectures     : 3
0.40/0.58	# Proof object initial clauses used    : 6
0.40/0.58	# Proof object initial formulas used   : 7
0.40/0.58	# Proof object generating inferences   : 1
0.40/0.58	# Proof object simplifying inferences  : 5
0.40/0.58	# Training examples: 0 positive, 0 negative
0.40/0.58	# Parsed axioms                        : 583
0.40/0.58	# Removed by relevancy pruning/SinE    : 0
0.40/0.58	# Initial clauses                      : 979
0.40/0.58	# Removed in clause preprocessing      : 235
0.40/0.58	# Initial clauses in saturation        : 744
0.40/0.58	# Processed clauses                    : 130
0.40/0.58	# ...of these trivial                  : 0
0.40/0.58	# ...subsumed                          : 7
0.40/0.58	# ...remaining for further processing  : 123
0.40/0.58	# Other redundant clauses eliminated   : 16
0.40/0.58	# Clauses deleted for lack of memory   : 0
0.40/0.58	# Backward-subsumed                    : 0
0.40/0.58	# Backward-rewritten                   : 0
0.40/0.58	# Generated clauses                    : 145
0.40/0.58	# ...of the previous two non-trivial   : 127
0.40/0.58	# Contextual simplify-reflections      : 1
0.40/0.58	# Paramodulations                      : 93
0.40/0.58	# Factorizations                       : 0
0.40/0.58	# NegExts                              : 0
0.40/0.58	# Equation resolutions                 : 19
0.40/0.58	# Propositional unsat checks           : 0
0.40/0.58	#    Propositional check models        : 0
0.40/0.58	#    Propositional check unsatisfiable : 0
0.40/0.58	#    Propositional clauses             : 0
0.40/0.58	#    Propositional clauses after purity: 0
0.40/0.58	#    Propositional unsat core size     : 0
0.40/0.58	#    Propositional preprocessing time  : 0.000
0.40/0.58	#    Propositional encoding time       : 0.000
0.40/0.58	#    Propositional solver time         : 0.000
0.40/0.58	#    Success case prop preproc time    : 0.000
0.40/0.58	#    Success case prop encoding time   : 0.000
0.40/0.58	#    Success case prop solver time     : 0.000
0.40/0.58	# Current number of processed clauses  : 112
0.40/0.58	#    Positive orientable unit clauses  : 50
0.40/0.58	#    Positive unorientable unit clauses: 1
0.40/0.58	#    Negative unit clauses             : 3
0.40/0.58	#    Non-unit-clauses                  : 58
0.40/0.58	# Current number of unprocessed clauses: 740
0.40/0.58	# ...number of literals in the above   : 3374
0.40/0.58	# Current number of archived formulas  : 0
0.40/0.58	# Current number of archived clauses   : 0
0.40/0.58	# Clause-clause subsumption calls (NU) : 1579
0.40/0.58	# Rec. Clause-clause subsumption calls : 962
0.40/0.58	# Non-unit clause-clause subsumptions  : 8
0.40/0.58	# Unit Clause-clause subsumption calls : 151
0.40/0.58	# Rewrite failures with RHS unbound    : 0
0.40/0.58	# BW rewrite match attempts            : 6
0.40/0.58	# BW rewrite match successes           : 2
0.40/0.58	# Condensation attempts                : 0
0.40/0.58	# Condensation successes               : 0
0.40/0.58	# Termbank termtop insertions          : 188253
0.40/0.58	
0.40/0.58	# -------------------------------------------------
0.40/0.58	# User time                : 0.195 s
0.40/0.58	# System time              : 0.027 s
0.40/0.58	# Total time               : 0.221 s
0.40/0.58	# Maximum resident set size: 2716 pages
0.40/0.59	EOF